Search results for "ordinary least–squares"

showing 1 items of 1 documents

Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?

2020

Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares problem. Several different solvers can be applied to the resulting linear problem. In this paper, a thorough comparison of possible and recently proposed, especially randomized, algorithms is carried out for this problem with a representative set of regression datasets. In addition, we compare MLM with shallow and deep feedforward neural network models and study the effects of the number of observations and the number of features with a special dat…

0209 industrial biotechnologyrandom projectionlcsh:Computer engineering. Computer hardwareComputational complexity theoryComputer scienceRandom projectionlcsh:TK7885-789502 engineering and technologyMachine learningcomputer.software_genresupervised learningapproximate algorithmsSet (abstract data type)regressioanalyysi020901 industrial engineering & automationdistance–based regressionalgoritmit0202 electrical engineering electronic engineering information engineeringordinary least–squaresbusiness.industrySupervised learningsingular value decompositionminimal learning machineMultilaterationprojektioRandomized algorithmkoneoppiminenmachine learningScalabilityFeedforward neural network020201 artificial intelligence & image processingArtificial intelligenceapproksimointibusinesscomputerMachine Learning and Knowledge Extraction
researchProduct